Optimum parameter for the SOR-like method for augmented systems

نویسندگان

  • Changjun Li
  • Zheng Li
  • Xinhui Shao
  • Yiyong Nie
  • David J. Evans
چکیده

Recently, several proposals for the generalization of Young’s SOR method to the saddle point problem or the augmented system has been presented. One of the most practical versions is the SOR-like method given by Golub et al., [(2001). SOR-like methods for augmented systems. BIT, 41, 71–85.], where the convergence and the determination of its optimum parameters were given. In this article, a full characterization of the spectral radius of the SOR-like iteration matrix is given, and an explicit expression for the optimum parameter is given in each case. The new results also lead to different results to that of Golub et al. Besides, it is shown that by the choices of the preconditioning matrix, the optimum SOR-like iteration matrix has no complex eigenvalues, therefore, it can be accelerated by semi-iterative methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalized successive over-relaxation method for the augmented systems. In this paper, the connection between the SOR-like method and the preconditioned conjugate gradient (PCG) method for the augmented systems is investigated. It is shown that the PCG method is at least as accurate (fast) as the SOR-like method. Numerical examples demonstrate that th...

متن کامل

Sor-like Methods for Augmented Systems Dedicated to Professor David Young

Several SOR-like algorithms are proposed for solving augmented systems which have appeared in many diierent applications of scientiic computing , for example, constrained optimization and the nite element approximation for solving the Stokes equation. The convergence and the choice of optimal parameter for these algorithms are studied. The convergence and divergence regions for some algorithms ...

متن کامل

Convergence of a semi-analytical method on the fuzzy linear systems

In this paper, we apply the  homotopy analysis method (HAM) for solving fuzzy  linear systems and present  the necessary and sufficient conditions for the convergence of series solution obtained via the HAM. Also, we present a new criterion for choosing a proper value of convergence-control parameter $hbar$ when the HAM is applied to linear system of equations. Comparisons are made between the ...

متن کامل

Generalized Iterative Methods for augmented linear systems ∗

In this paper we study the solution of large sparse augmented linear systems. The generalized modified extrapolated SOR (GMESOR) method is considered. We find sufficient conditions for GMESOR to converge and determine its optimal iteration parameters and the corresponding minimum value of its convergence factor. Under the assumption that the eigenvalues of a key matrix are real it is shown that...

متن کامل

On the Successive Overrelaxation Method

Problem statement: A new variant of the Successive Overrelaxation (SOR) method for solving linear algebraic systems, the KSOR method was introduced. The treatment depends on the assumption that the current component can be used simultaneously in the evaluation in addition to the use the most recent calculated components as in the SOR method. Approach: Using the hidden explicit characterization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2004